Average of complete joint weight enumerators and self-dual codes

Complete weight enumerators of generalized doubly-even self-dual codes

For any q which is a power of 2 we describe a finite subgroup of GLqðCÞ under which the complete weight enumerators of generalized doubly-even self-dual codes over Fq are invariant. An explicit description of the invariant ring and some applications to extremality of such codes are obtained in the case q 1⁄4 4: r 2003 Elsevier Inc. All rights reserved.

A Note on Weight Enumerators of Linear Self-dual Codes

A partial description of (complete) weight enumerators of linear self-dual codes is given. 0. Let F = Z/pZ, where p is a prime number. If C is a linear code on F of length n, i.e., a linear subspace in Fn, then its (complete) weight enumerator WC is defined to be

Complete Weight Enumerators of Some Linear Codes

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime p, we determine the explicit complete weight enumerators of two classes of linear codes over Fp and they may have applications in cryptography and secret sharing schemes. Moreover, some examples are included to illustrate our results. Index Terms Linear code, complete weight e...

Weight enumerators of self-orthogonal codes

A construction of linear codes and their complete weight enumerators

Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let m > 2 be a positive integer. For an odd prime p, let r = p and Tr be the absolute trace function from Fr onto Fp. In this paper, we give a construction of linear codes by defining the code CD = {(Tr(ax))x∈D : a ∈ Fr}, where D = { x ∈ Fr :...